Frege against the Booleans.

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hybrid Booleans

In this paper we present a novel method to compute Boolean operations on polygonal meshes. Given a Boolean expression over an arbitrary number of input meshes we reliably and efficiently compute an output mesh which faithfully preserves the existing sharp features and precisely reconstructs the new features appearing along the intersections of the input meshes. The term "hybrid" applies to our ...

متن کامل

Fast, Exact, Linear Booleans

We present a new system for robustly performing Boolean operations on linear, 3D polyhedra. Our system is exact, meaning that all internal numeric predicates are exactly decided in the sense of exact geometric computation. Our BSP-tree based system is 16-28× faster at performing iterative computations than CGAL’s Nef Polyhedra based system, the current best practice in robust Boolean operations...

متن کامل

Adaptive Mesh Booleans

We present a new method for performing Boolean operations on volumes represented as triangle meshes. In contrast to existing methods which treat meshes as 3D polyhedra and try to partition the faces at their exact intersection curves, we treat meshes as adaptive surfaces which can be arbitrarily refined. Rather than depending on computing precise face intersections, our approach refines the inp...

متن کامل

The predicative Frege hierarchy

In this paper, we characterize the strength of the predicative Frege hierarchy, PV, introduced by John Burgess in his book [Bur05]. We show that PV and Q + con(Q) are mutually interpretable. It follows that PV := PV is mutually interpretable with Q. This fact was proved earlier by Mihai Ganea in [Gan06] using a different proof. Another consequence of the our main result is that PV is mutually i...

متن کامل

The Curse of Frege

I mention two methodological problems with AI's study of inference that have to do with excessive faith in classical logic. The first is the familiar bias toward formalisms that incorporate deductive patterns of argument: a bias against inductive patterns of reasoning. The second is the pretension that inference can be studied with no regard for one's habits of representation. By implicating Fr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Notre Dame Journal of Formal Logic

سال: 1987

ISSN: 0029-4527

DOI: 10.1305/ndjfl/1093636848